Sum-of-squares clustering on networks
نویسندگان
چکیده
منابع مشابه
An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملOn the Complexity of Minimum Sum-of-Squares Clustering
To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We examine causes for such confusion and in the process show that a recent proof of Drineas et al. in Machine Learning 56, 9–33, 2004 is not valid and unlikely to be salvaged.
متن کاملConstrained Minimum Sum of Squares Clustering by Constraint Programming
The Within-Cluster Sum of Squares (WCSS) is the most used criterion in cluster analysis. Optimizing this criterion is proved to be NP-Hard and has been studied by different communities. On the other hand, Constrained Clustering allowing to integrate previous user knowledge in the clustering process has received much attention this last decade. As far as we know, there is a single approach that ...
متن کاملClustering and Sum of Squares Proofs: Six Blog Posts on Unsupervised Learning
This note contains six blog posts comprising a tutorial on the Sum of Squares method in unsupervised learning, using clustering in mixtures of Gaussians as an extended example. They originally appeared on the Windows on Theory blog in December, 2017. I would like to thank Boaz Barak, Daniel Freund, Gautam “G” Kamath, Ilya Mironov, and David Steurer for the many improvements they suggested. Rema...
متن کاملA survey on exact methods for minimum sum-of-squares clustering
Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of n entities into k clusters in order to minimize the sum of squared distances from the entities to the centroid of their cluster. Among many criteria used for cluster analysis, the minimum sum-of-squares is one of the most popular since it expresses both homogeneity and separation. A mathematical programming formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2011
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor1102157c